Parallel implementation of the Bi-CGSTAB method with block red-black Gauss-Seidel preconditioner applied to the Hermite collocation discretization of partial differential equations
نویسندگان
چکیده
We describe herein the parallel implementation of the Bi-CGSTAB method with a block Red-Black Gauss-Seidel (RBGS) preconditioner applied to the systems of linear algebraic equations that arise from the Hermite collocation discretization of partial di erential equations in two spatial dimensions. The method is implemented on the Cray T3E, a parallel processing supercomputer. Speedup results are discussed.
منابع مشابه
Preconditioning for solving Hermite Collocation by the Bi-CGSTAB
Explicit pre/post conditioning of the large, sparse and non-symmetric system of equations, arising from the discretization of the Dirichlet Poisson’s Boundary Value Problem (BVP) by the Hermite Collocation method is the problem considered herein. Using the 2-cyclic (red-black) structure of the Collocation coefficient matrix, we investigate the eigenvalue distribution of its preconditioned analo...
متن کاملMPI Management of Hermite Collocation Computation on a Distributed-Shared Memory System
The organization and management of the intense computation involved in the solution of large, sparse and non-symmetric systems of equations, arising from the discretization of Elliptic Boundary Value Problems (BVPs) by the Hermite Collocation method, on a Distributed-Shared Memory (DSM) multiprocessor environment is the problem considered herein. As the size of the problem directly suggests the...
متن کاملGrid Computing for the Bi-CGSTAB applied to the solution of the Modified Helmholtz Equation
The problem addressed herein is the efficient management of the Grid/Cluster intense computation involved, when the preconditioned Bi-CGSTAB Krylov method is employed for the iterative solution of the large and sparse linear system arising from the discretization of the Modified Helmholtz-Dirichlet problem by the Hermite Collocation method. Taking advantage of the Collocation matrix’s red-black...
متن کاملA Parallel Preconditioned Bi-Conjugate Gradient Algorithm for Two-Dimensional Elliptic and Parabolic Equations Using Hermite Collocation
A fast and parallelizable method to solve sparse matrix equations that arise from the Hermite collocation discretization of elliptic and parabolic partial di erential equations (PDEs) can be obtained using a bi-conjugate gradient algorithm. A Red-Black GaussSeidel matrix preconditioner provides a structure which makes the algorithm amenable to parallel processing. Increased e ciency is achieved...
متن کاملParallel Iterative Solution of the Hermite Collocation Equations on GPUs
We consider the computationally intense problem of solving the large, sparse and non-symmetric system of equations arising from the discretization of elliptic Boundary Value Problems (BVPs) by the Collocation finite element method using Hermite bi-cubic elements. As the size of the problem directly suggests the usage of parallel iterative methods, we consider the implementation on multiprocesso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 28 شماره
صفحات -
تاریخ انتشار 2002